Cost analysis of object-oriented bytecode programs
نویسندگان
چکیده
منابع مشابه
Cost analysis of object-oriented bytecode programs
Cost analysis statically approximates the cost of programs in terms of their inputdata size. This paper presents, to the best of our knowledge, the first approach tothe automatic cost analysis of Object-Oriented bytecode programs. In languagessuch as Java and C#, analyzing bytecode has a much wider application areathan analyzing source code since the latter is often not availabl...
متن کاملAnalysis of object-oriented programs: a survey
We survey code analysis research, applications and infrastructure, focusing on object-oriented languages. In particular we cover static and dynamic program analysis, including non-conservative analysis, and also consider language extensions facilitating program analysis, and libraries and tools for doing analysis. The discussion outlines challenges and opportunities for program analysis when ap...
متن کاملCompile-Time Analysis of Object-Oriented Programs
Generation of efficient c d e for ob ject-orient4 programs requir~ knowledge of object Iifetimes and method bindings. For object-oriented Ianguages that have automatic storqge management and dynamic look-up of methods, the compiler must obtain such knowledge by performing static analysis of the source code. We present a.n analysis algorithm which discovers the potential classes of each object i...
متن کاملAnalysis of Object-Oriented Programs Using Graphs
Complex interdependencies between diierent parts of a system are a major problem for the maintenance, evolution, and reorganization of large programs. In an object-oriented system, such dependencies exist due to diierent kinds of interrelationships between the diierent kinds of entities which make up the system. Reengineering large object-oriented systems requires methods and tools for analyzin...
متن کاملPair-Sharing Analysis of Object-Oriented Programs
Pair-sharing analysis of object-oriented programs determinesthose pairs of program variables bound at run-time to overlapping datastructures. This information is useful for program parallelisation andanalysis. We follow a similar construction for logic programming andformalise the property, or abstract domain, Sh of pair-sharing. We provethat Sh induces a Galois insertion w....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.07.009